Adaptive Constriction Factor for Location-related Particle Swarm

نویسندگان

  • XIANG-HAN CHEN
  • WEI-PING LEE
  • CHEN-YI LIAO
  • JANG-TING DAI
چکیده

-Particle Swarm Optimization (PSO) has received increased attention in the evolutionary computation fields recently. In the paper, we proposed Adaptive constriction factor for Location-related Particle Swarm (ALPS) that is shown to be superior when compared with the existing PSO algorithm. We adapt a technique of overcoming complex problems with PSO. This is accomplished by using the ratio of the relative location of better particles to determine the direction in which each constriction factor of the particle needs to be varied. Finally, we are presented experiment results on benchmark functions testify ALPS’s efficiency. Key-Words: Particle swarm optimization, optimization, evolutionary computation, constriction factor, adaptive method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Dna Sequence Assembly Using Particle Swarm Optimization with Inertia Weight and Constriction Factor

This paper introduces an effectual technique to solve the DNA sequence assembly problem using a variance of the standard Particle Swarm Optimization (PSO) called the Constriction factor Particle Swarm Optimization (CPSO).The problem of sequence assembly is one of the primary problems in computational molecular biology that requires optimization methodologies to rebuild the original DNA sequence...

متن کامل

Research on Location Problem of Multi - distribution Center based on Chaos Adaptive Mutation Particle Swarm Optimization Algorithm

Location problem of multi-distribution center is a kind of NP hard problem. To solve such problems, this paper proposes a chaos adaptive mutation particle swarm optimization algorithm. The algorithm uses the ergodic property of chaos to initialize the particle swarm to enhance the diversity of the population, according to the variance of population fitness to adjust the probability of mutation,...

متن کامل

Variable Head Hydrothermal Generation Scheduling Using Genetic Algorithm and Constriction Factor Based Particle Swarm Optimization Technique

In this paper, a genetic algorithm and constriction factor based particle swarm optimization technique are proposed for solving the short term variable head hydrothermal scheduling problem with transmission line losses. The performance efficiency of the proposed techniques is demonstrated on hydrothermal test system comprising of two thermal units and two hydro power plants. the simulation resu...

متن کامل

Optimal Placement and Sizing of DGs and Shunt Capacitor Banks Simultaneously in Distribution Networks using Particle Swarm Optimization Algorithm Based on Adaptive Learning Strategy

Abstract: Optimization of DG and capacitors is a nonlinear objective optimization problem with equal and unequal constraints, and the efficiency of meta-heuristic methods for solving optimization problems has been proven to any degree of complex it. As the population grows and then electricity consumption increases, the need for generation increases, which further reduces voltage, increases los...

متن کامل

Comparing Inertia Weights and Constriction Factors in Particle Swarm Optimization

The performance of particle swarm optimization using an inertia weight is compared with performance using a constriction factor. Five benchmark functions are used for the comparison. It is concluded that the best approach is to use the constriction factor while limiting the maximum velocity Vmax to the dynamic range of the variable Xmax on each dimension. This approach provides performance on t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007